Multi-machine scheduling with variance minimization
نویسندگان
چکیده
منابع مشابه
Multi-machine Scheduling with Variance Minimization
This paper addresses the problem of scheduling n jobs on m identical parallel machines so as to minimize the completion time variance. Properties of optimal solutions are derived first. Then, complexity results are obtained, which show that the problem is NP-complete in the strong sense when m is arbitrary, and NP-complete in the ordinary sense when m is fixed. Two algorithms are proposed. The ...
متن کاملMulti-operation multi-machine scheduling
In the multi-operation scheduling that arises in industrial engineering, each job contains multiple tasks (operations) that require execution in different shops. It is assumed that in each shop there is only one machine to perform the required operations. In this paper, a parallel model of multi-operation scheduling is proposed, in which multiple machines are available in each shop to perform t...
متن کاملMakespan minimization in online scheduling with machine eligibility
In this paper we provide a survey of online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function. We first give a brief overview of the different parallel machine environments and then survey the various types of machine eligibility constraints, including treehierarchical processing sets, Grade of Service processing sets, interv...
متن کاملBattery Energy Storage Scheduling for Optimal Load Variance Minimization
Generation portfolio can be significantly altered due to the deployment of distributed energy resources (DER) in distribution networks and the concept of microgrid. Generally, distribution networks can operate in a more resilient and economic fashion through proper coordination of DER. However, due to the partially uncontrollable and stochastic nature of some DER, the variance of net load of di...
متن کاملMinimization of agreeably weighted variance in single machine systems
This paper considers the variance minimization problem with job-dependent weights. We show that an optimal job sequence must be V-shaped in terms of weighted processing time when the problem is agreeably weighted, in the sense that Pi <(Pj implies w i > wj, where Pi and w i are the processing time and the weight of job i, respectively. An O(nWP) algorithm is proposed to find an optimal solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00020-1